- arbitrary input
- ТМОпроизвольный входящий поток
English-Russian scientific dictionary. 2008.
arbitrary input
Смотреть что такое "arbitrary input" в других словарях:
Unicode input — Many systems provide direct Unicode input support in some form to allow selection of arbitrary Unicode characters. Selection from a screen Many systems provide a way to select Unicode characters visually. ISO 14755 refers to this as a screen… … Wikipedia
Smiles arbitrary target specification — (SMARTS) is a language for specifying substructural patterns in molecules. The SMARTS line notation is expressive and allows extremely precise and transparent substructural specification and atom typing.SMARTS is related to the SMILES line… … Wikipedia
Simplified molecular input line entry specification — Infobox file format name = smiles extension = .smi mime = owner = creatorcode = genre = chemical file format container for = contained by = extended from = extended to = The simplified molecular input line entry specification or SMILES is a… … Wikipedia
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
dc (computer program) — dc is a cross platform reverse polish desk calculator which supports arbitrary precision arithmetic.[1] It is one of the oldest Unix utilities, predating even the invention of the C programming language; like other utilities of that vintage, it… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Machine that always halts — In computability theory, a machine that always halts also called a decider (Sipser, 1996) or a total Turing machine (Kozen, 1997) is a Turing machine that halts for every input. Because it always halts, the machine is able to decide whether a… … Wikipedia
Concolic testing — (a portmanteau of concrete and symbolic) is a hybrid software verification technique that interleaves concrete execution (testing on particular inputs) with symbolic execution, a classical technique that treats program variables as symbolic… … Wikipedia
Criticism of APL — APL has been used since the mid 1960s on mainframe computers and has itself evolved in step with computers and the computing market. APL is not widely used, but minimalistic and high level by design, at several points in its history it could have … Wikipedia
LTI system theory — or linear time invariant system theory is a theory in the field of electrical engineering, specifically in circuits, signal processing, and control theory, that investigates the response of a linear, time invariant system to an arbitrary input… … Wikipedia
3D single object recognition — In computer vision, 3D single object recognition involves recognizing and determining the pose of user chosen 3D object in a photograph or range scan. Typically, an example of the object to be recognized is presented to a vision system in a… … Wikipedia
